Reversible Template-based Shake & Bake Generation

نویسندگان

  • Michel Carl
  • Paul Schmidt
  • Jörg Schütz
چکیده

Corpus-based MT systems that analyse and generalise texts beyond the surface forms of words require generation tools to re-generate the various internal representations into valid target language (TL) sentences. While the generation of word-forms from lemmas is probably the last step in every text generation process at its very bottom end, token-generation cannot be accomplished without structural and morpho-syntactic knowledge of the sentence to be generated. As in many other MT models, this knowledge is composed of a target language model and a bag of information transferred from the source language. In this paper we establish an abstracted, linguistically informed, target language model. We use a tagger, a lemmatiser and a parser to infer a template grammar from the TL corpus. Given a linguistically informed TL model, the aim is to see what need be provided from the transfer module for generation. During computation of the template grammar, we simultaneously build up for each TL sentence the content of the bag such that the sentence can be deterministically reproduced. In this way we control the completeness of the approach and will have an idea of what pieces of information we need to code in the TL bag.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Template-Grammars for Shake & Bake Paraphrasing

In this paper we propose an approach to corpus-based generation in a machine translation framework that is similar to shake & bake (Whitelock, 1992). A bag of words is mapped against an automatically induced TL template grammar and a sentence is generated by recursively applying rules that are extracted from the template grammar. A test version of the template grammar is enriched with further l...

متن کامل

A Chart Generator for Shake and Bake Machine Translation

A generation algorithm based on an active chart parsing algorithm is introduced which can be used in conjunction with a Shake and Bake machine translation system. A concise Prolog implementation of the algorithm is provided, and some performance comparisons with a shift-reduce based algorithm are given which show the chart generator is much more efficient for generating all possible sentences f...

متن کامل

Some Aspects of Shake-and-bake Machine Translation between English and Italian

Shake-and-Bake is an approach to bidirectional and multilingual Machine Translation which takes advantage of the features of lexically-based uniication grammars to design modular systems, where grammars are written on purely monolingual considerations. An extension to the standard Shake-and-Bake model is proposed in order to increase such peculiarities. It consists in introducing in the system ...

متن کامل

Improving the Efficiency of a Generation Algorithm for Shake and Bake Machine Translation Using Head-Driven Phrase Structure Grammar

A Shake and Bake machine translation algorithm for Head-Driven Phrase Structure Grammar is introduced based on the algorithm proposed by Whitelock for unification categorial grammar. The translation process is then analysed to determine where the potential sources of inefficiency reside, and some proposals are introduced which greatly improve the efficiency of the generation algorithm. Prelimin...

متن کامل

An Efficient Generation Algorithm for Lexicalist MT

The lexicalist approach to Machine Translation offers significant advantages in the development of linguistic descriptions. However, the Shake-and-Bake generation algorithm of (Whitelock, 1992) is NPcomplete. We present a polynomial time algorithm for lexicalist MT generation provided that sufficient information can be transferred to ensure more determinism.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005